|
In quantum information theory, the classical capacity of a quantum channel is the maximum rate at which classical data can be sent over it error-free in the limit of many uses of the channel. Holevo, Schumacher, and Westmoreland proved the following lower bound on the classical capacity of any quantum channel : : where is a classical-quantum state of the following form: : is a probability distribution, and each is a density operator that can be input to the channel . == Achievability using sequential decoding == We briefly review the HSW coding theorem (the statement of the achievability of the Holevo information rate for communicating classical data over a quantum channel). We first review the minimal amount of quantum mechanics needed for the theorem. We then cover quantum typicality, and finally we prove the theorem using a recent sequential decoding technique. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Classical capacity」の詳細全文を読む スポンサード リンク
|